An Exactification of the Monoid of Primitive Recursive Functions
نویسندگان
چکیده
We study the monoid of primitive recursive functions and investigate a onestep construction of a kind of exact completion, which resembles that of the familiar category of modest sets, except that the partial equivalence relations which serve as objects are recursively enumerable. As usual, these constructions involve the splitting of symmetric idempotents.
منابع مشابه
A Hierarchy of Unary Primitive Recursive String-Functions
1 I n t r o d u c t i o n Let N be the set of naturals i.e. N = {0,1, 2, . . .}. Consider a fixed alphabet A = {a l ,a2 , . . . ,at}, r > 2 and denote by A* the free monoid generated by A under concatenation (with e the null string). The elements of A* are called strings; if reffering to strings, " < " denotes the lexicographical order induced by al < a2 < . . . < at. Denote by Fnc (respectivel...
متن کاملPrimitive orthogonal idempotents for R-trivial monoids
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any Rtrivial monoid. This uses the newly proved equivalence between the notions of R-trivial monoid and weakly ordered monoid. Résumé. Nous construisons une formule récursive pour un système complet d’idempotents orthogonaux primitifs pour tout monoı̈de R-trivial. Nous employons une nouvelle équivalenc...
متن کاملPrimitive recursive functions versus partial recursive functions: comparing the degree of undecidability
Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial recursive or a primitive recursive function. A similar situation happens for results like Rice Theorem (which is false for primitive recursive functions). Classical...
متن کاملAutomatic Parallelization of Recursive Functions with Rewriting Rules
Functional programming languages have, since their early days, being thought as the holy grail of parallelism. And, in fact, the absence of race conditions, coupled with algorithmic skeletons such as map and reduce, have given developers the opportunity to write many different techniques aimed at the automatic parallelization of programs. However, there are many functional programs that are sti...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 81 شماره
صفحات -
تاریخ انتشار 2005